Model checking security protocols: a multi-agent system approach
نویسندگان
چکیده
We present a formalism for the automatic verification of security protocols based on multi-agent systems semantics. We give syntax and semantics of a temporal-epistemic security-specialised logic and provide a lazy-intruder model for the protocol rules that is arguably particularly suitable for verification purposes. We exemplify the technique by finding a (known) bug in the traditional NSPK protocol.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملProcess algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملLDYIS: a Framework for Model Checking Security Protocols
We present a formalism for the automatic verification of security protocols based on multi-agent systems semantics. We give the syntax and semantics of a temporal-epistemic securityspecialised logic and provide a lazy-intruder model for the protocol rules that we argue to be particularly suitable for verification purposes. We exemplify the technique by finding a (known) bug in the traditional N...
متن کاملAn Approach to Model Checking of Multi-agent Data Analysis
The paper presents an approach to verification of a multi-agent data analysis algorithm. We base correct simulation of the multi-agent system by a finite integer model. For verification we use model checking tool SPIN. Protocols of agents are written in Promela language and properties of the multiagent data analysis system are expressed in logic LTL. We run several experiments with SPIN and the...
متن کاملVerification of Payment Protocols via MultiAgent Model Checking
The paper presents a logic of belief and time (called MATL) that can be used to verify electronic payment protocols. This logic encompasses its predecessors in the family of logics of authentication. According to our approach, the verification is performed by means of MultiAgent Model Checking Checking, an extension of traditional model checking to cope with time and beliefs. In this framework,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008